A new monte carlo algorithm for growing compact Self Avoiding Walks
نویسندگان
چکیده
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on a square lattice at zero temperature, in cotrast to the existing algorithms. More importantly, the IGW algorithm facilitates growing compact configurations at lower temperatures a feature that makes it attractive for studying a variety of processes such as the folding of proteins. We demonstrate that our algorithm correctly describes the collapse transition of a homopolymer in two dimensions.
منابع مشابه
A New Monte Carlo algorithm for Growing Compact Self Avoiding Walks
We have presented an algorithm based on local growth rules for kinetically generating SAW configurations at any given temperature, T ≥ 0. This algorithm not only suffers less attrition (infact, no attrition at T = 0) but also is able to selectively grow compact configurations at lower temperatures. We have demonstrated explicitly in two dimensions that it correctly describes the collapse transi...
متن کاملOrigin of Scaling Behavior of Protein Packing Density: A Sequential Monte Carlo Study of Compact Long Chain Polymers
Single domain proteins are thought to be tightly packed. The introduction of voids by mutations is often regarded as destabilizing. In this study we show that packing density for single domain proteins decreases with chain length. We find that the radius of gyration provides poor description of protein packing but the alpha contact number we introduce here characterize proteins well. We further...
متن کاملCorrection-to-Scaling Exponents for Two-Dimensional Self-Avoiding Walks
We study the correction-to-scaling exponents for the two-dimensional selfavoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-avoiding walks up to 59 steps on the square lattice, and up to 40 steps on the triangular lattice, measuring the mean-square end-to-end distance, the mean-square radius of gyration and the mean-square distance of a mon...
متن کاملCut-and-permute algorithm for self-avoiding walks in the presence of surfaces
We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and “cut-and-permute” moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot algorithm exhibits quasi-ergodic problems. The dynamic properties of the proposed algorithm are studied. The hybrid dynamics is ergodic and exhibits the same optimal ...
متن کاملRecoil growth: an efficient simulation method for multi-polymer systems
We present a new Monte Carlo scheme for the efficient simulation of multipolymer systems. The method permits chains to be inserted into the system using a biased growth technique. The growth proceeds via the use of a retractable feeler, which probes possible pathways ahead of the growing chain. By recoiling from traps and excessively dense regions, the growth process yields high success rates f...
متن کامل